SSE and SSD: Page-Efficient Searchable Symmetric Encryption
نویسندگان
چکیده
Searchable Symmetric Encryption (SSE) enables a client to outsource database an untrusted server, while retaining the ability securely search data. The performance bottleneck of classic SSE schemes typically does not come from their fast, symmetric cryptographic operations, but rather cost memory accesses. To address this issue, many works in literature have considered notion locality, simple design criterion that helps capture accesses traditional storage media, such as Hard Disk Drives. A common thread among aiming improve locality is they are built on top new allocation schemes, which form technical core constructions. starting observation work for newer media Solid State Drives (SSDs), become increasingly common, good predictor practical performance. Instead, SSD mainly depends page efficiency, is, reading few pages possible. We define notion, and identify problem, Data-Independent Packing (DIP), captures main challenge required build page-efficient SSE. As our result, we storage-efficient data-independent packing scheme, deduce $$\mathsf {Tethys}$$ first scheme achieve at once $$\mathcal {O}(1)$$ efficiency efficiency. result generalization cuckoo hashing items variable size. Practical experiments show approach achieves excellent
منابع مشابه
Adaptively Secure Computationally Efficient Searchable Symmetric Encryption
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as possible to the server. In the symmetric searchable encryption domain, the storage and the retrieval are performed by the same client. Most conventional searchable encryption schemes suffer from two dis...
متن کاملStorage Efficient Substring Searchable Symmetric Encryption
We address the problem of substring searchable encryption. A single user produces a big stream of data and later on wants to learn the positions in the string that some patterns occur. Although current techniques exploit auxiliary data structures to achieve efficient substring search on the server side, the cost at the user side may be prohibitive. We revisit the work of substring searchable en...
متن کاملGarbled Searchable Symmetric Encryption
In a searchable symmetric encryption (SSE) scheme, a client can keyword search over symmetrically-encrypted files which he stored on the server (ideally without leaking any information to the server). In this paper, we show the first multiple keyword search SSE scheme such that even the search formula f (AND, OR and so on) is kept secret. Our scheme is based on an extended garbled circuit satis...
متن کاملSubstring-Searchable Symmetric Encryption
In this paper, we consider a setting where a client wants to outsource storage of a large amount of private data and then perform substring search queries on the data – given a data string s and a search string p, find all occurrences of p as a substring of s. First, we formalize an encryption paradigm that we call queryable encryption, which generalizes searchable symmetric encryption (SSE) an...
متن کاملVerifiable Searchable Symmetric Encryption
OF A DISSERTATION SUBMITTED TO THE FACULTY OF THE DEPARTMENT OF COMPUTER SCIENCE IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY COMPUTER SCIENCE UNIVERSITY OF MASSACHUSETTS LOWELL 2013 Dissertation Supervisor: Jie Wang, Ph.D. Professor and Chair, Department of Computer Science Cloud storage has become increasingly prevalent in recent years. It provides a conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-84252-9_6